Mining models of exceptional objects through rule learning.

An incremental clustering scheme for data de%2Dduplication.

Rule Learning with Probabilistic Smoothing.

High Quality True%2DPositive Prediction for Fiscal Fraud Detection.

Clustering Relational Data A Transactional Approach.

A Hierarchical Rule%2Dbased Framework for Accurate Classification in Imprecise Domains.

SNIPER A Data Mining Methodology for Fiscal Fraud Detection.

The DAEDALUS framework progressive querying and mining of movement data.

A hierarchical model%2Dbased approach to co%2Dclustering high%2Ddimensional data.

DAEDALUS A knowledge discovery analysis framework for movement data.

Querying and Reasoning for Spatiotemporal Data Mining.

Mining categories for emails via clustering and pattern discovery.

Data Mining for Effective Risk Analysis in a Bank Intelligence Scenario.

Boosting text segmentation via progressive classification.

Data Mining for Effective Risk Analysis in a Bank Intelligence Scenario.

A Hierarchical Probabilistic Model for Co%2DClustering High%2DDimensional Data.

Exploiting structural similarity for effective Web information extraction.

Top%2DDown Parameter%2DFree Clustering of High%2DDimensional Categorical Data.

Mining unconnected patterns in workflows.

Effective Incremental Clustering for Duplicate Detection in Large Databases.

Top%2DDown Parameter%2DFree Clustering of High%2DDimensional Categorical Data.

Effective Incremental Clustering for Duplicate Detection in Large Databases.

Exploiting Structural Similarity For Effective Web Information Extraction.

An Incremental Clustering Scheme for Duplicate Detection in Large Databases.

A Data Mining%2Dbased Framework for GridWorkflow Management.

Mining Unconnected Patterns in Workflows.

Mining Correlations in Workflows Executions.

RecBoost A Supervised Approach to Text Segmentation.

Fast Detection of XML Structural Similarity.

Mining and Reasoning on Workflows.
Workflow management systems represent today a key technological infrastructure for advanced applications which is attracting a growing body of research, mainly focused in developing tools for workflow management, that allow the users both to specify the “static ” aspects, like preconditions, precedences among activities, rules for exception handling, and to control its execution, by scheduling the activities on the available resources. This paper deals with an aspect of workflows which has so far not received much attention even though it is crucial for the forthcoming scenarios of large scale applications on the web: providing facilities for the human system administrator for identifying the choices performed more frequently in the past that had lead to a desired final configuration. In this context, we formalize the problem of discovering the most frequent patterns of executions, i.e., the workflow substructures that have been scheduled more frequently by the system. We attacked the problem by developing two data mining algorithms, on the basis of an intuitive and original graph formalization of a workflow schema and its occurrences. The model is used both to prove some intractability results, that strongly motivate the use of data mining techniques, and to derive interesting structural properties for reducing the space of search for frequent patterns. Indeed the experiments we have carried out show
Mining Constrained Graphs The Case of Workflow Systems.

Towards a Logic Query Language for Data Mining.

A Tree%2DBased Approach to Clustering XML Documents by Structure.

Clustering of XML Documents by Structure based on Tree Matching and Merging.

Web wrapper induction a brief survey.
Workshop held in conjunction withPreface Today on-line communities, as well as individuals, produce a substantial amount of unstructured (and extemporaneous) content, arising from tacit and explicit knowledge sharing. Various approaches, both in the managerial and computer science fields, are seeking ways to crystallize the- somewhat volatile, but often highly valuable- knowledge contained in communities &#034;chatters&#034;. Among those approaches, the most relevants appear to be those aimed at developing and formalizing agreed-upon semantic representations of specific knowledge domains (i.e. domain ontologies). Nonetheless, the intrinsic limits of technologies underpinning such approaches tend to push communities members towards the spontaneous adoption of less cumbersome tools, usually offered in the framework of the Web 2.0 (e.g. folksonomies, XML-based tagging, etc.), for sharing and retrieving knowledge. Inside this landscape, community members should be able to access and browse community knowledge transparently and in a personalized way, through tools that
Specifying Mining Algorithms with Iterative User%2DDefined Aggregates.

Eureka%21 an interactive and visual knowledge discovery tool.

Logical Languages for Data Mining.

Mining Frequent Instances on Workflows.

Similarity%2DBased Clustering of Web Transactions.

Eureka%21  A Tool for Interactive Knowledge Discovery.

A Framework for Adaptive Mail Classification.

LDL%2DMine Integrating Data Mining with Intelligent Query Answering.

Characterizing Web User Accesses A Transactional Approach to Web Log Clustering.

LDL%2DMine Integrating Data Mining with Intelligent Query Answering.


Clustering Transactional Data.
It is widely recognized that developing efficient and fully automated algorithms for clustering large transactional datasets is a challenging problem. In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the concept of Weighted Coverage Density as a categorical similarity measure for efficient clustering of transactional datasets. The concept of weighted coverage density is intuitive and allows the weight of each item in a cluster to be changed dynamically according to the occurrences of items. Second, we develop two transactional data clustering specific evaluation metrics based on the concept of large transactional items and the coverage density respectively. Third, we implement the weighted coverage density clustering algorithm and the two clustering validation metrics using a fully automated transactional clustering framework, called SCALE (Sampling, Clustering structure Assessment, cLustering and domain-specific Evaluation). The SCALE framework is designed to combine the weighted coverage density measure for clustering over a sample dataset with self-configuring methods that can automatically tune the two important parameters of the clustering algorithms: (1) the candidates of the best number K of clusters; and (2) the application of two domain-specific cluster validity measures to find the best result from the set of clustering results. We have conducted experimental evaluation using both synthetic and real datasets and our results show that the weighted coverage-density approach powered by the SCALE framework can efficiently generate high quality clustering results in a fully automated manner.

Detecting Structural Similarities between XML Documents.
Abstract. In this paper we propose a technique for detecting the similarity in the structure of XML documents. The technique is based on the idea of representing the structure of an XML document as a time series in which each occurrence of a tag corresponds to a given impulse. By analyzing the frequencies of the corresponding Fourier transform, we can hence state the degree of similarity between documents. The efficiency and effectiveness of this approach are compelling when compared with traditional ones. 1
Clustering Transactional Data.
It is widely recognized that developing efficient and fully automated algorithms for clustering large transactional datasets is a challenging problem. In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the concept of Weighted Coverage Density as a categorical similarity measure for efficient clustering of transactional datasets. The concept of weighted coverage density is intuitive and allows the weight of each item in a cluster to be changed dynamically according to the occurrences of items. Second, we develop two transactional data clustering specific evaluation metrics based on the concept of large transactional items and the coverage density respectively. Third, we implement the weighted coverage density clustering algorithm and the two clustering validation metrics using a fully automated transactional clustering framework, called SCALE (Sampling, Clustering structure Assessment, cLustering and domain-specific Evaluation). The SCALE framework is designed to combine the weighted coverage density measure for clustering over a sample dataset with self-configuring methods that can automatically tune the two important parameters of the clustering algorithms: (1) the candidates of the best number K of clusters; and (2) the application of two domain-specific cluster validity measures to find the best result from the set of clustering results. We have conducted experimental evaluation using both synthetic and real datasets and our results show that the weighted coverage-density approach powered by the SCALE framework can efficiently generate high quality clustering results in a fully automated manner.
Data Mining for Intelligent Web Caching.
The paper presents a vertical application of data warehousing and data mining technology:  intelligent web caching. We introduce several ways to construct intelligent web  caching algorithms that employ predictive models of web requests; the general idea is to  extend the LRU policy of web and proxy servers by making it sensible to web access models  extracted from web log data using data mining techniques. Two approaches have been  studied in particular, one based on association rules and another based on decision trees.
Specifying Mining Algorithms with Iterative User%2DDefined Aggregates A Case Study.

Clustering Transactional Data.
It is widely recognized that developing efficient and fully automated algorithms for clustering large transactional datasets is a challenging problem. In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the concept of Weighted Coverage Density as a categorical similarity measure for efficient clustering of transactional datasets. The concept of weighted coverage density is intuitive and allows the weight of each item in a cluster to be changed dynamically according to the occurrences of items. Second, we develop two transactional data clustering specific evaluation metrics based on the concept of large transactional items and the coverage density respectively. Third, we implement the weighted coverage density clustering algorithm and the two clustering validation metrics using a fully automated transactional clustering framework, called SCALE (Sampling, Clustering structure Assessment, cLustering and domain-specific Evaluation). The SCALE framework is designed to combine the weighted coverage density measure for clustering over a sample dataset with self-configuring methods that can automatically tune the two important parameters of the clustering algorithms: (1) the candidates of the best number K of clusters; and (2) the application of two domain-specific cluster validity measures to find the best result from the set of clustering results. We have conducted experimental evaluation using both synthetic and real datasets and our results show that the weighted coverage-density approach powered by the SCALE framework can efficiently generate high quality clustering results in a fully automated manner.


Nondeterministic%2C Nonmonotonic Logic Databases.
We consider in this paper an extension of Datalog with mechanisms for temporal, nonmonotonic and nondeterministic reasoning, which we refer to as Datalog++. We show, by means of examples, its flexibility in expressing queries concerning aggregates and data cube. Also, we show how iterated fixpoint and stable model semantics can be combined to the purpose of clarifying the semantics of Datalog++ programs, and supporting their efficient execution. Finally, we provide a more concrete implementation strategy, on which basis the design of optimization techniques tailored for Datalog++ is addressed.
Declarative Knowledge Extraction with Interactive User%2DDefined Aggregates.

Making Knowledge Extraction and Reasoning Closer.

Experiences with a Logic%2Dbased knowledge discovery Support Environment.

Experiences with a Logic%2DBased Knowledge Discovery Support Environment.

Querying Inductive Databases via Logic%2DBased User%2DDefined Aggregates.

Querying inductive Databases via Logic%2DBased user%2Ddefined aggregates.

Querying Inductive Databases via Logic%2DBased User%2DDefined Aggregates.

Integration of Deduction and Induction for Mining Supermarket Sales Data.

On the Effective Semantics of Nondeterministic
We consider in this paper an extension of Datalog with mechanisms for temporal, nonmonotonic and nondeterministic reasoning, which we refer to as Datalog++. We study its semantics, and show how iterated fixpoint and stable model semantics can be combined to the purpose of clarifying the interpretation of Datalog++ programs, and supporting their efficient execution. On this basis, the design of appropriate optimization techniques for Datalog++ is also discussed.
Query Answering in Nondeterministic%2C Nonmonotonic Logic Databases.

A Deductive Data Model for Representing and Querying Semistructured Data.
We show how the mechanisms of an active/deductive object-oriented model are capable of modeling the information available on the World Wide Web, the paradigmatic example of a large, distributed collection of poorly structured, heterogeneous information, consisting of documents connected by hypertext links. We exhibit the basic features of the object model, including the schema definition language, the query language with multiple roles, the basic update operations, and a form of active rules, and a compilation of the mentioned features into a fragment of  LDL++, which is essentially Datalog extended with non-determinism and a form of stratified negation. The proposed compilation has a twofold aim. On one side, it should provide an abstract implementation level, where the object model is declaratively reconstructed and its semantics clarified. On the other side, the proposed compilation should form the basis of a realistic implementation, as LDL++ can be efficiently executed, and suppor...
Datalog   A Basis for Active Object%2DOriented Databases.
We consider in this paper an extension of Datalog with mechanisms for temporal, non monotonic and non deterministic reasoning, which we refer to as Datalog++. First, we study its semantics, and show how iterated fixpoint and stable model semantics can be combined to the purpose of clarifying the interpretation of Datalog++ programs, and supporting their efficient execution. Second, we exhibit a compilation into Datalog++ of an active/deductive object-oriented model, ADOOD, including the schema definition language, the query language with multiple roles, the basic update operations, and a form of active rules. The proposed compilation is intended both to illustrate the expressiveness of Datalog++, and to provide a more flexible programming front-end to it. Finally, we illustrate the use of ADOOD by means of examples from semistructured data management.
Datalog   a Basis for Active Object.Oriented Databases.
We consider in this paper an extension of Datalog with mechanisms for temporal, non monotonic and non deterministic reasoning, which we refer to as Datalog++. First, we study its semantics, and show how iterated fixpoint and stable model semantics can be combined to the purpose of clarifying the interpretation of Datalog++ programs, and supporting their efficient execution. Second, we exhibit a compilation into Datalog++ of an active/deductive object-oriented model, ADOOD, including the schema definition language, the query language with multiple roles, the basic update operations, and a form of active rules. The proposed compilation is intended both to illustrate the expressiveness of Datalog++, and to provide a more flexible programming front-end to it. Finally, we illustrate the use of ADOOD by means of examples from semistructured data management.
Modeling Object Dynamics in Object%2DOriented Logic Programming.

A Structural %28Meta%2DLogical%29 Semantics for Linear Objects.

